Random graphs, weak coarse embeddings, and higher index theory
نویسندگان
چکیده
منابع مشابه
Random graphs, weak coarse embeddings, and higher index theory
This paper studies higher index theory for a random sequence of bounded degree, finite graphs with diameter tending to infinity. We show that in a natural model for such random sequences the following hold almost surely: the coarse Baum-Connes assembly map is injective; the coarse Baum-Connes assembly map is not surjective; the maximal coarse BaumConnes assembly map is an isomorphism. These res...
متن کاملRecognizing Weak Embeddings of Graphs
We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding φ : G→M of a graph G into a 2-manifold M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often b...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملUniform Linear Embeddings of Spatial Random Graphs
In a random graph with a spatial embedding, the probability of linking to a particular vertex v decreases with distance, but the rate of decrease may depend on the particular vertex v, and on the direction in which the distance increases. In this article, we consider the question when the embedding can be chosen to be uniform, so the probability of a link between two vertices depends only on th...
متن کاملApproximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Topology and Analysis
سال: 2015
ISSN: 1793-5253,1793-7167
DOI: 10.1142/s1793525315500156